An improved lower bound for the bin packing problem
نویسندگان
چکیده
منابع مشابه
An Improved Lower Bound on First-Fit's Accommodating Ratio for the Unit Price Bin Packing Problem
The lower bound on First-Fit's accommodating ratio, for the Unit Price Bin Packing problem, is improved to 5=8.
متن کاملNew Lower Bound for the Bin Packing Problem
The bin packing problem can be defined as follows: Given a set L of n items i, with sizes wi, for any (1 ≤ i ≤ n) and a set of identical bins with capacity C, with an objective to determine the minimal number of bins necessary to pack all the items, so that the sum of the volumes of the items in the same bin does not exceed the capacity of the bin. The problem has many real-world applications (...
متن کاملAn Improved Lower Bound for a Semi-on-line Bin Packing Problem
On-line algorithms have been extensively studied for the onedimensional bin packing problem. Semi-online property relax the online prescription in such a way that it allows some extra operations or the algorithm knows more (e.g. the optimum value) in advance. In this paper we present an improved lower bound for the asymptotic competitive ratio of any on-line bin packing algorithm which knows th...
متن کاملAn Improved Lower Bound for a Semi-on-line Bin Packing Problem
On-line algorithms have been extensively studied for the onedimensional bin packing problem. Semi-online property relax the online prescription in such a way that it allows some extra operations or the algorithm knows more (e.g. the optimum value) in advance. In this paper we present an improved lower bound for the asymptotic competitive ratio of any on-line bin packing algorithm which knows th...
متن کاملAn 8/3 Lower Bound for Online Dynamic Bin Packing
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart dynamically. The objective is to minimize the maximum number of bins used over all time. The main result is a lower bound of 8/3 ∼ 2.666 on the achievable competitive ratio, improving the best known 2.5 lower bound. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(96)80459-8